Contraction Ratios for Graph-directed Iterated Constructions
نویسنده
چکیده
We provide necessary and sufficient conditions for a graph-directed iterated function system to be strictly contracting.
منابع مشابه
A generalized finite type condition for iterated function systems
We study iterated function systems (IFSs) of contractive similitudes on Rd with overlaps. We introduce a generalized finite type condition which extends a more restrictive condition in [S.-M. Ngai, Y. Wang, Hausdorff dimension of self-similar sets with overlaps, J. London Math. Soc. (2) 63 (3) (2001) 655–672] and allows us to include some IFSs of contractive similitudes whose contraction ratios...
متن کاملAn analogue of Cobham's theorem for graph directed iterated function systems
Feng and Wang showed that two homogeneous iterated function systems in R with multiplicatively independent contraction ratios necessarily have different attractors. In this paper, we extend this result to graph directed iterated function systems in R with contraction ratios that are of the form 1 β , for integers β. By using a result of Boigelot et al., this allows us to give a proof of a conje...
متن کاملCommon fixed point of multivalued graph contraction in metric spaces
In this paper, we introduce the (G-$psi$) contraction in a metric space by using a graph. Let $F,T$ be two multivalued mappings on $X.$ Among other things, we obtain a common fixed point of the mappings $F,T$ in the metric space $X$ endowed with a graph $G.$
متن کاملA Fractal Dimension Estimate for a Graph-directed Iterated Function System of Non-similarities
Suppose a graph-directed iterated function system consists of maps fe with upper estimates of the form d ( fe(x),fe(y) ) ≤ red(x,y). Then the fractal dimension of the attractor Kv of the IFS is bounded above by the dimension associated to the Mauldin–Williams graph with ratios re. Suppose the maps fe also have lower estimates of the form d ( fe(x),fe(y) ) ≥ r′ ed(x,y) and that the IFS also sati...
متن کاملA Fractal Dimension Estimate for a Graph-directed Ifs of Non-similarities
Suppose a graph-directed iterated function system consists of maps fe with upper estimates of the form d ( fe(x), fe(y) ) ≤ red(x, y). Then the fractal dimension of the attractor Kv of the IFS is bounded above by the dimension associated to the Mauldin–Williams graph with ratios re. Suppose the maps fe also have lower estimates of the form d ( fe(x), fe(y) ) ≥ r e d(x, y) and that the IFS also ...
متن کامل